and its automorphism group

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Characterization of C by its Automorphism Group

Let M be a connected complex manifold of dimension n and let Aut(M) denote the group of holomorphic automorphisms of M . The group Aut(M) is a topological group equipped with the natural compact-open topology. We are interested in the problem of characterizing M by Aut(M). This problem becomes particularly intriguing when Aut(M) is infinite-dimensional. Let, for example, M = C and suppose that ...

متن کامل

Ultra regular covering space and its automorphism group

In order to classify digital spaces in terms of digital-homotopic theoretical tools, a recent paper by Han (2006b) (see also the works of Boxer and Karaca (2008) as well as Han (2007b)) established the notion of regular covering space from the viewpoint of digital covering theory and studied an automorphism group (or Deck’s discrete transformation group) of a digital covering. By using these to...

متن کامل

Group Extensions and Automorphism Group Rings

We use extensions to study the semi-simple quotient of the group ring FpAut(P ) of a finite p-group P . For an extension E : N → P → Q, our results involve relations between Aut(N), Aut(P ), Aut(Q) and the extension class [E] ∈ H(Q,ZN). One novel feature is the use of the intersection orbit group Ω([E]), defined as the intersection of the orbits Aut(N) · [E] and Aut(Q) · [E] in H(Q,ZN). This gr...

متن کامل

AUTOMORPHISM GROUP OF GROUPS OF ORDER pqr

H"{o}lder in 1893 characterized all groups of order $pqr$ where  $p>q>r$ are prime numbers. In this paper,  by using new presentations of these groups, we compute their full automorphism group.

متن کامل

THE AUTOMORPHISM GROUP OF FINITE GRAPHS

Let G = (V,E) be a simple graph with exactly n vertices and m edges. The aim of this paper is a new method for investigating nontriviality of the automorphism group of graphs. To do this, we prove that if |E| >=[(n - 1)2/2] then |Aut(G)|>1 and |Aut(G)| is even number.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Pure and Applied Algebra

سال: 2014

ISSN: 0022-4049

DOI: 10.1016/j.jpaa.2013.10.005